منابع مشابه
Speedy versus sluggish cells
Brain building H ow your brain grows might come down to how your cells divide. Lake and Sokol report that mouse protein Vangl2 controls the asymmetrical cell division and developmental fate of progenitor neurons. Vangl2 (aka Strabismus in fl ies) is a component of the PCP (planar cell polarity) pathway that is active in a variety of tissues and organisms. Mice that lack Vangl2 have a number of ...
متن کاملSpeedy versus Greedy Search
In work on satisficing search, there has been substantial attention devoted to how to solve problems associated with local minima or plateaus in the heuristic function. One technique that has been shown to be quite promising is using an alternative heuristic function that does not estimate cost-to-go, but rather estimates distance-to-go. Empirical results generally favor using the distance-to-g...
متن کاملHuman Speedy
The decision for a cell to self-replicate requires passage from G1 to S phase of the cell cycle and initiation of another round of DNA replication. This commitment is a critical one that is tightly regulated by many parallel pathways. Significantly, these pathways converge to result in activation of the cyclin-dependent kinase, cdk2. It is, therefore, important to understand all the mechanisms ...
متن کاملSluggish and brisk ganglion cells detect contrast with similar sensitivity.
Roughly half of all ganglion cells in mammalian retina belong to the broad class, termed "sluggish." Many of these cells have small receptive fields and project via lateral geniculate nuclei to visual cortex. However, their possible contributions to perception have been largely ignored because sluggish cells seem to respond weakly compared with the more easily studied "brisk" cells. By selectin...
متن کاملSpeedy Q-Learning
We introduce a new convergent variant of Q-learning, called speedy Q-learning, in order to address the problem of slow convergence in the standard form of the Q-learning algorithm. We prove a PAC bound on the performance of SQL, which shows that only T = O ( log(1/δ)ǫ(1 − γ) ) steps are required for the SQL algorithm to converge to an ǫ-optimal action-value function with high probability. This ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cell Biology
سال: 2009
ISSN: 1540-8140,0021-9525
DOI: 10.1083/jcb.1851iti2